#include <stdio.h>
#include <stdlib.h>
int a[101],n;

void quicksort(int left,int right){
	int i,j,t;
    i=left;
    j=right;
    if(i>j)return;
    int temp=a[left];
    while(i<j){
        while(temp<a[j] && i<j)j--;
        while(temp>a[i] && i<j)i++;
        while(i<j){t=a[i];a[i]=a[j];a[j]=t;}
    }
	a[left]=a[i];
	a[i]=temp;
    quicksort(left,i-1);
    quicksort(i+1,right);
    return;
}
int main(){
	scanf("%d",&n);
for(int i=1;i<=n;i++){
    scanf("%d",&a[i]);
}
quicksort(1,n);
int sum=1;
for(int i=1;i<n;i++){
    if(a[i]!=a[i+1]){sum++;}
}
printf("%d\n",sum);
    return 0;
}




